Dependency-Based Action Refinement
نویسندگان
چکیده
Abs t rac t . Action refinement in process algebras has been widely studied in the last few years as a means to support top-down design of systems. A specific notion of refinement arises when a dependency relation on the actions (in the Mazurkiewicz sense) is used to control the inheritance of orderings from the abstract level. In this paper we present a rather simple operational semantics for dependency-based action refinement. We show the consistency of the operational with a (previously published) denotational semantics. We moreover show that bisimulation is a congruence for dependency-based refinement. Finally, we give an illustrative example.
منابع مشابه
A Theory of Service Dependency
Service composition has become commonplace nowadays, in large part due to the increased complexity of software and supporting networks. Composition can be of many types, for instance sequential, prioritising, non-deterministic. However, a fundamental feature of the services to be composed consists in their dependencies with respect to each other. In this paper we propose a theory of service dep...
متن کاملSAT based Abstraction Refinement for Hardware Verification
Model checking is a widely used automatic formal verification technique. Despite the recent advances in model checking technology, its application is still limited by the state explosion problem. For model checking large real world systems, abstraction is essential. This thesis investigates abstraction techniques for the efficient verification of hardware designs with thousands of registers. A ...
متن کاملModular Termination Proofs for Rewriting Using Dependency Pairs
Recently, Arts and Giesl developed the dependency pair approach which allows automated termination and innermost termination proofs for many term rewriting systems (TRSs) for which such proofs were not possible before. The motivation for this approach was that virtually all previous techniques for automated termination proofs of TRSs were based on simplification orderings. In practice, however,...
متن کاملAlgebraic Foundations of Proof Refinement
We contribute a general apparatus for dependenttactic-based proof refinement in the LCF tradition, in which thestatements of subgoals may express a dependency on the proofs ofother subgoals; this form of dependency is extremely useful andcan serve as an algorithmic alternative to extensions of LCF basedon non-local instantiation of schematic variables. Additionally,we in...
متن کاملFormalizing Dependency Directed Backtracking and Explanation Based Learning in Refinement Search
The ideas of dependency directed backtracking (DDB) and explanation based learning (EBL) have developed independently in constraint satisfaction, planning and problem solving communities. In this paper, I formalize and unify these ideas under the task-independent framework of refinement search, which can model the search strategies used in both planning and constraint satisfaction. I show that ...
متن کامل